Scalable non-negative matrix tri-factorization: Supplementary material
نویسندگان
چکیده
We provide further details on performance analysis for our block-wise matrix tri-factorization. In particular, we include analysis of orthogonal matrix tri-factorization that is discussed in our manuscript but whose results, due to conceptual similarity with non-orthogonal factorization were not included in there. We also present the impact of communication overhead on both non-orthogonal and orthogonal NMTF models and show results on the scalability of 4-processor and 4-GPU implementations with regards to factorization rank. Finally, we analyze the speed-up of balanced partitioning.
منابع مشابه
Iterative Weighted Non-smooth Non-negative Matrix Factorization for Face Recognition
Non-negative Matrix Factorization (NMF) is a part-based image representation method. It comes from the intuitive idea that entire face image can be constructed by combining several parts. In this paper, we propose a framework for face recognition by finding localized, part-based representations, denoted “Iterative weighted non-smooth non-negative matrix factorization” (IWNS-NMF). A new cost fun...
متن کاملA new approach for building recommender system using non negative matrix factorization method
Nonnegative Matrix Factorization is a new approach to reduce data dimensions. In this method, by applying the nonnegativity of the matrix data, the matrix is decomposed into components that are more interrelated and divide the data into sections where the data in these sections have a specific relationship. In this paper, we use the nonnegative matrix factorization to decompose the user ratin...
متن کاملLearning Latent Features with Infinite Non-negative Binary Matrix Tri-factorization
Non-negative Matrix Factorization (NMF) has been widely exploited to learn latent features from data. However, previous NMF models often assume a fixed number of features, say p features, where p is simply searched by experiments. Moreover, it is even difficult to learn binary features, since binary matrix involves more challenging optimization problems. In this paper, we propose a new Bayesian...
متن کاملFast Robust Non-Negative Matrix Factorization for Large-Scale Human Action Data Clustering
Human action recognition is important in improving human life in various aspects. However, the outliers and noise in data often bother the clustering tasks. Therefore, there is a great need for the robust data clustering techniques. Nonnegative matrix factorization (NMF) and Nonnegative Matrix Tri-Factorization (NMTF) methods have been widely researched these years and applied to many data clus...
متن کاملFast Bayesian Non-Negative Matrix Factorisation and Tri-Factorisation
Nonnegative matrix factorisation and tri-factorisation Nonnegative matrix factorisation (NMF) and tri-factorisation (NMTF) methods decompose a given matrix R into two or three smaller matrices so that R ≈ UV T or R ≈ FSG , respectively. Schmidt, Winther and Hansen (2009) introduced a Bayesian version of nonnegative matrix factorisation (left), which we extend to matrix tri-factorisation (right)...
متن کامل